Let $A = \{a_1, a_2, a_3, ..., a_n\}$ be a set containing $n$ elements. Two subsets $P$ and $Q$ of $A$ are formed independently. The number of ways in which these subsets can be formed such that $(P - Q)$ contains exactly $2$ elements is:

  • A
    $^nC_2 \cdot 2^{n-2}$
  • B
    $^nC_2 \cdot 3^{n-2}$
  • C
    $^nC_2 \cdot 2^n$
  • D
    None of these

Explore More

Similar Questions

If $a_n = \sum_{r = 0}^n \frac{1}{^nC_r}$,then $\sum_{r = 0}^n \frac{r}{^nC_r}$ equals

Difficult
View Solution

If the number of $5$-element subsets of the set $A = \{a_1, a_2, \dots, a_{20}\}$ of $20$ distinct elements is $k$ times the number of $5$-element subsets containing $a_4$,then $k$ is

Difficult
View Solution

$A$ question paper has $2$ parts,part $A$ and part $B$,each containing $10$ questions. If a student has to choose $8$ questions from part $A$ and $5$ questions from part $B$,in how many ways can the student choose the questions?

The product of any $r$ consecutive natural numbers is always divisible by

In how many different ways can the letters of the word '$LEADING$' be arranged in such a way that the vowels always come together?

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo